Learning regular expressions for clinical text classification

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithms for Learning Regular Expressions

We describe algorithms that directly infer regular expressions from positive data and characterize the regular language classes that can be learned this way.

متن کامل

Concept Learning for Regular Expressions

Evolutionary algorithms aim to harness ideas from biological evolution in order to explore search spaces that may be hard to understand at a glance. Instead of viewing search spaces from an evolutionary perspective, we may also look at exploration from the perspective of a human learner. Instead of trying to tackle the most difficult problems in a problem domain at the outset, this approach ini...

متن کامل

Efficient classification of strings using regular expressions

This paper presents a new method of compiling a large set of patterns, described in regular expression syntax, into a new data structure, in order to efficiently determine at runtime which of the patterns is matched by an input string. This problem arises in network security and a wide variety of other businesses. In evaluation tests on data sets used for security information and event manageme...

متن کامل

Transfer learning for text classification

Linear text classification algorithms work by computing an inner product between a test document vector and a parameter vector. In many such algorithms, including naive Bayes and most TFIDF variants, the parameters are determined by some simple, closed-form, function of training set statistics; we call this mapping mapping from statistics to parameters, the parameter function. Much research in ...

متن کامل

Learning of regular expressions by pattern matching

We are considering the problem of restoring regular expressions from representative examples. We describe a natural learning algorithm for obtaining a \plausible" regular expression from one example. The algorithm is based on nding the longest substring which can be matched by some part of the so far obtained expression. We believe that the algorithm to a certain extent mimics humans guessing r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the American Medical Informatics Association

سال: 2014

ISSN: 1067-5027,1527-974X

DOI: 10.1136/amiajnl-2013-002411